THE COMPLEXITY OF FINDING FIXED-RADIUS NEAR NEIGHBORS.BENTLEY JL; STANAT DF; WILLIAMS EH JR et al.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 209-212; BIBL. 9 REF.Article

OPTIMAL ASSOCIATIVE SEARCHING ON A CELLULAR COMPUTERSTANAT DF; WILLIAMS EH JR.1981; CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE/1981/PORTSMOUTH NH; USA; NEW YORK: ACM; DA. 1981; PP. 99-106; BIBL. 13 REF.Conference Paper

ASSOCIATIVE RETRIEVAL TRIE HASH-CODING.BURKHARD WA.1977; J. COMPUTERS SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 280-299; BIBL. 23 REF.Article

AN ASSOCIATIVE SEARCH LANGUAGE FOR DATA MANAGEMENTAMAR MUKHOPADHYAY; HURSON A.1979; NATIONAL COMPUTER CONFERENCE/1979/NEW YORK NY; USA; MONTVALE: AFIPS PRESS; DA. 1979; PP. 727-732; BIBL. 20 REF.Conference Paper

ANALYSIS OF ASSOCIATIVE RETRIEVAL ALGORITHMSRIVEST RL.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 54; PP. (110P.); BIBL. 7P.Article

MULTIDIMENSIONAL TRIES USED FOR ASSOCIATIVE SEARCHINGORENSTEIN JA.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 150-157; BIBL. 22 REF.Article

DELETION IN TWO-DIMENSIONAL QUAD TREESSAMET H.1980; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1980; VOL. 23; NO 12; PP. 703-710; BIBL. 8 REF.Article

MULTIDIMENSIONAL ASSOCIATIVE SEARCHING.FRIEDMAN JH.1976; C.E.R.N.; SUISSE; DA. 1976; VOL. 76; NO 24; PP. 227-257; BIBL. 11 REF.; (CERN SCH. COMPUT. 4. PROC.; LA GRANDE MOTTE, FR.; 1976)Conference Paper

A NOTE ON EUCLIDEAN NEAR NEIGHBOR SEARCHING IN THE PLANEBENTLEY JL; MAURER H.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 3; PP. 133-136; BIBL. 9 REF.Article

PARTIAL-MATCH RETRIEVAL ALGORITHMS.RIVEST RL.1976; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 19-50; BIBL. 2 P.Article

MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHINGBENTLEY JL.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 9; PP. 509-517; BIBL. 7REF.Article

A browser for large knowledge bases based on a hybrid distributed/local connectionist architectureTARIQ SAMAD; ISRAEL, P.IEEE transactions on knowledge and data engineering. 1991, Vol 3, Num 1, pp 89-99, issn 1041-4347Article

A rapid turnaround design of a high speed VLSI search processorMATOBA, T; LEE, K. C; HERMAN, G. E et al.Integration (Amsterdam). 1991, Vol 10, Num 3, pp 319-337, issn 0167-9260, 19 p.Article

Microcomputer applications in the library: exploring Lexis/Nexis: using Microsoft PowerPoint to illustrate FREESTYLE^TMDUVAL, B. K; MAIN, L.Library software review. 1994, Vol 13, Num 3, pp 224-231, issn 0742-5759Article

Searching the web by constrained spreading activationCRESTANI, F; PUAY LENG LEE.Information processing & management. 2000, Vol 36, Num 4, pp 585-605, issn 0306-4573Article

A concept space approach to addressing the vocabulary problem in scientific information retrieval : An experiment on the worm community systemCHEN, H; NG, T. D; MARTINEZ, J et al.Journal of the American Society for Information Science. 1997, Vol 48, Num 1, pp 17-31, issn 0002-8231Article

Associative and Boolean retrieval: a comparative analysisVIGIL, P. J.International online information meeting. 1994, pp 57-62, isbn 0-904933-88-1Conference Paper

An associative model of word selection in the generation of search queriesFERBER, R; WETTLER, M; RAPP, R et al.Journal of the American Society for Information Science. 1995, Vol 46, Num 9, pp 685-699, issn 0002-8231Article

Search mechanisms using a neural network model: comparison with the vector space modelJOSIANE, M.RIAO 94 : recherche d'information assistée par ordinateur. Conférence. 1994, pp 275-294, isbn 2-905450-05-3Conference Paper